The Generalized Reed-Muller Codes in a Modular Group Algebra

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Generalized Reed-Muller codes in a modular group algebra

First we study some properties of the modular group algebra Fpr [G] where G is the additive group of a Galois ring of characteristic pr and Fpr is the field of p r elements. Secondly a description of the Generalized Reed-Muller codes over Fpr in Fpr [G] is presented.

متن کامل

Generalized Reed-Muller Codes

the possible choices for n and k are rather thinly distributed in the class of all pairs (n, k) with k ~ n--and it is, therefore, often inefficient to make use of such codes in concrete situations (that is, when a desired pair (n, k) is far from any achievable pair). We have succeeded in overcoming this difficulty by generalizing the Reed-Muller codes in such a way that they exist for every pai...

متن کامل

The Generalized Reed-Muller codes and the radical powers of a modular algebra

First, a new proof of Berman and Charpin’s characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra. Secondly, the same method is used for the study of the Generalized Reed-Muller codes over a non prime field.

متن کامل

The automorphism group of Generalized Reed-Muller codes

Berger, T. and P. Charpin, The automorphism group of Generalized Reed-Muller codes, Discrete Mathematics 117 (1993) l-17. We prove that the automorphism group of Generalized Reed-Muller codes is the general linear nonhomogeneous group. The Generalized Reed-Muller codes are introduced by Kasami, Lin and Peterson. An extensive study was made by Delsarte, Goethals and Mac-Williams; our result foll...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Journal of Mathematics & Computer Science

سال: 2017

ISSN: 2231-0851

DOI: 10.9734/bjmcs/2017/30145